#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	vector<int>  v={393353,901440,123481,850930,423154, 240461,373746, 232926, 396677, 486579, 744860, 468782,941389, 777714, 992588, 343292, 385198, 876426,483857, 241899 ,544851, 647930,772403, 109929,882745, 372491, 877710, 340000, 659788, 658675,296521, 491295, 609764, 718967, 842000, 670302};
	int count = 0;
	int j;
	int arr[36] ={0};
	for(int i=0;i<v.size();i++)
	{
		count=0,j=2;
		while((v[i]>>1)>j)
		{
			if(v[i]%j==0) count++;
			j++;
		}
		arr[i]=count;
	}
	count=1;
	while(count <=36)
	{
		cout<< arr[count-1]<<' '; 
		
		if(count%6==0)
		{
			cout << '\n';
		}
		count++;
	}
	return 0;
} 
